Increasing the power of the verifier in Quantum Zero Knowledge
نویسندگان
چکیده
In quantum zero knowledge, the assumption was made that the verifier is only using unitary operations. Under this assumption, many nice properties have been shown about quantum zero knowledge, including the fact that Honest-Verifier Quantum Statistical Zero Knowledge (HVQSZK) is equal to Cheating-Verifier Quantum Statistical Zero Knowledge (QSZK) (see [Wat02, Wat06]). In this paper, we study what happens when we allow an honest verifier to flip some coins in addition to using unitary operations. Flipping a coin is a non-unitary operation but doesn’t seem at first to enhance the cheating possibilities of the verifier since a classical honest verifier can flip coins. In this setting, we show an unexpected result: any classical Interactive Proof has an Honest-Verifier Quantum Statistical Zero Knowledge proof with coins. Note that in the classical case, honest verifier SZK is no more powerful than SZK and hence it is not believed to contain even NP . On the other hand, in the case of cheating verifiers, we show that Quantum Statistical Zero Knowledge where the verifier applies any non-unitary operation is equal to Quantum Zero-Knowledge where the verifier uses only unitaries. One can think of our results in two complementary ways. If we would like to use the honest verifier model as a means to study the general model by taking advantage of their equivalence, then it is imperative to use the unitary definition without coins, since with the general one this equivalence is most probably not true. On the other hand, if we would like to use quantum zero knowledge protocols in a cryptographic scenario where the honest-but-curious model is sufficient, then adding the unitary constraint severely decreases the power of quantum zero knowledge protocols. ∗Supported in part by ACI Securité Informatique SI/03 511 and ANR AlgoQP grants of the French Ministry and in part by the European Commission under the Integrated Project Qubit Applications (QAP) funded by the IST directorate as Contract Number 015848.
منابع مشابه
imits on the Power of Quantum Statistical Zero-Knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV . We prove several facts regarding this class, including: The following problem is a complete promise problem for QSZKHV : given instructions for preparing two mixed quantum states, are the states close together...
متن کاملLimits on the power of quantum statistical zero-knowledge
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: • The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together o...
متن کاملMaking Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against all, possibly cheating classical and quantum polynomial time verifiers. Here we refer to the generalized notion of zero-knowledge with classical and quantum auxiliary inputs respectively. Our conditi...
متن کاملWitness-Indistinguishability Against Quantum Adversaries
Proof systems are a central concept in complexity theory and cryptography. Zero-knowledge and witnessindistinguishability are useful security properties of proof systems. Considering the increased power of quantum computation, it comes as a natural question to understand what happens to these security properties when quantum computation becomes feasible. Zero-knowledge [GMR89] is the security p...
متن کاملQuantum statistical zero-knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK: given instructions for preparing two mixed quantum states, are the states close together or far...
متن کامل